reed-solomon-novelpoly 1.0.2

An implementation of a reed solomon code / encoder / decoder with complexity `O(n lg(n))`
Documentation

reed-solomon-novelpoly

An implementation of Novel Polynomial Basis and its Application to Reed-Solomon Erasure Codes 1 2 .

Runs encoding and reconstruction in O(n lg(n)). Note that for small number n there is a static offset due to a walsh transform over the full domain in reconstruction.

Goals

Be really fast for n > 100.

Non-goals

TODO